A Decoding Algorithm for Convolutional Codes
نویسندگان
چکیده
It is shown how the decoding algorithms of Pellikaan and Rosenthal can be coupled to produce a algorithm for convolutional codes. Bounds computational cost per decoded codeword are also computed. As case study, our results applied family codes constructed by Rosenthal–Schumacher–York and, in this situation, previous bounds turn out polynomial on degree code.
منابع مشابه
An Algebraic Decoding Algorithm for Convolutional Codes
The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...
متن کاملLow Complexity Algorithm for Optimal Hard Decoding of Convolutional Codes
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...
متن کاملLow complexity algorithm for soft decoding of convolutional codes
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose a soft decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, performance close...
متن کاملViterbi decoding algorithm for convolutional codes with repeat request
Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resuking performance is analyzed by random coding aud generatiug function arguments and by simtdation. It is &own that the reliability function of tbe proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical...
متن کاملA Decoding Algorithm for Some Convolutional Codes Constructed from Block Codes
A new decoding algorithm for some convolution~l codes constructed from block codes is given. The algorithm utilizes the decoding algorithm for the corresponding block code. It is shown that the codes obtained from one-step orthogonalizable block codes are majority deeodable. Error propagation in some of these convolutional codes is studied. It is shown that if decoded with moderately reduced ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10091573